Computability of Fraïssé limits

Fräıssé studied countable structures S through analysis of the age of S, i.e., the set of all finitely generated substructures of S. We investigate the effectiveness of his analysis, considering effectively presented lists of finitely generated structures and asking when such a list is the age of a computable structure. We focus particularly on the Fräıssé limit. We also show that degree spectra of relations on a sufficiently nice Fräıssé limit are always upward closed unless the relation is definable by a quantifier-free formula. We give some sufficient or necessary conditions for a Fräıssé limit to be spectrally universal. As an application, we prove that the computable atomless Boolean algebra is spectrally universal.